Firstly, sorting the apex of the triangular facets according to ascending order in their slice direction was proposed to filter out redundant vertex quickly;
在综合多种算法优点的基础上,首先提出了对三角面片的顶点按其切片方向进行从小到大排序,以快速滤除冗余顶点;
We'll be slicing things by a plane that is now in the direction of this vector,u and we'll be looking at the slope of the slice of the graph.
用沿着向量方向的平面,切开图像,然后看图像的剖面图,找出斜率。
OK, so, if I have a point, at any point, I can slice the graph of my function by two planes, one that's going along the x, one along the y direction.
如果我有一个点,任意一点,我可以用2个平面把函数图像切开,一个是沿x方向,一个沿y方向。
And I can obviously do the other direction which is I can say skip to index 2 and all the remaining pieces. This lets me slice out, if you like, the front part or back part or a middle part of the tuple as I go along.
很明显我可以从索引2开始切片,所有剩下的元素,这可以让我2,如果你喜欢我这么说的话,取得元素的前面的或者后面的,或者中间的部分。
应用推荐